An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton
نویسندگان
چکیده
The aim of this paper is to describe a CREW-PRAM optimal algorithm which converts a regular expression of size s into its Glushkov automaton in O(log s) time using O(s/ log s) processors. This algorithm makes use of the star normal form of an expression as defined by Brüggemann-Klein and is based on the sequential algorithm due to Ziadi, Ponty and Champarnaud, which computes an original representation of Glushkov automaton in O(s) time.
منابع مشابه
Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton and Yamada, is based on the computation of the Null, First, Last and Follow sets (called Glushkov functions) associated with a linearized version of the expression. Recently Mignot considered a family of extended expr...
متن کاملCharacterization of Glushkov automata
Glushkov algorithm computes a nondeterministic nite automaton without-transition and with n + 1 states from a simple regular expression having n occurrences of letters. The aim of this paper is to give a set of necessary and suucient conditions characterizing this automaton. Our characterization theorem is formulated in terms of directed graphs. Moreover these conditions allow us to produce an ...
متن کاملRegular Expressions into Finite Automata
It is a well-established fact that each regular expression can be transformed into a non-deterministic nite automaton (NFA) with or without-transitions, and all authors seem to provide their own variant of the construction. Of these, Berry and Sethi 4] have shown that the construction of an-free NFA due to Glushkov 10] is a natural representation of the regular expression, because it can be des...
متن کاملAlgorithm for the k-Position Tree Automaton Construction
The word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||E || + 1) states for a word expression of alphabetic width ||E ||. This kind of automata is extended to regular tree expressions. In this paper, we give an efficient algorithm that computes the Follow sets, which are used in different algorithms of conversion of a re...
متن کاملCompact and Fast Algorithms for Regular Expression Search
This paper describes an improvement of the brute force determinization algorithm in the case of homogeneous NFAs, as well as its application to pattern matching. Brute force determinization with limited memory may provide a partially determinized automaton, but its bounded complexity makes it be a fail-safe procedure contrary to the classical subset construction. We investigate the particular c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 215 شماره
صفحات -
تاریخ انتشار 1999